Asymptotic Study of Subcritical Graph Classes
نویسندگان
چکیده
We present a unified general method for the asymptotic study of graphs from the so-called “subcritical” graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works both in the labelled and unlabelled framework. The main results concern the asymptotic enumeration and the limit laws of properties of random graphs chosen from subcritical classes. We show that the number gn/n! (resp. gn) of labelled (resp. unlabelled) graphs on n vertices from a subcritical graph class G = ∪nGn satisfies asymptotically the universal behaviour gn = c n −5/2 γ (1 + o(1)) for computable constants c, γ, e.g. γ ≈ 9.38527 for unlabelled series-parallel graphs, and that the number of vertices of degree k (k fixed) in a graph chosen uniformly at random from Gn, converges (after rescaling) to a normal law as n→∞.
منابع مشابه
$G$-asymptotic contractions in metric spaces with a graph and fixed point results
In this paper, we discuss the existence and uniqueness of fixed points for $G$-asymptotic contractions in metric spaces endowed with a graph. The result given here is a new version of Kirk's fixed point theorem for asymptotic contractions in metric spaces endowed with a graph. The given result here is a generalization of fixed point theorem for asymptotic contraction from metric s paces to metr...
متن کاملAsymptotic study of families of unlabelled trees and other unlabelled graph structures
This thesis deals with the asymptotic analysis of diverse random graph structures, especially random trees. For this purpose, we consider the set of objects of fixed size n (where the size is mostly describing the number of vertices of a graph), and choose an object from it uniformly at random. We discuss properties of such a random representative, as the size n tends to infinity. All results a...
متن کاملSubgraph statistics in subcritical graph classes
Let H be a fixed graph and G a subcritical graph class. In this paper we show that the number of occurrences of H (as a subgraph) in a uniformly at random graph of size n in G follows a normal limiting distribution with linear expectation and variance. The main ingredient in our proof is the analytic framework developed by Drmota, Gittenberger and Morgenbesser to deal with infinite systems of f...
متن کاملThe size of the largest component below phase transition in inhomogeneous random graphs .
We study the ”rank 1 case” of the inhomogeneous random graph model. In the subcritical case we derive an exact formula for the asymptotic size of the largest connected component scaled to log n. This result is new, it completes the corresponding known result in the supercritical case. We provide some examples of application of a new formula. 2000 Mathematics Subject Classification: 60C05; 05C80.
متن کاملPersistent Betti numbers of random Čech complexes
We study the persistent homology of random Čech complexes. Generalizing a method of Penrose for studying random geometric graphs, we first describe an appropriate theoretical framework in which we can state and address our main questions. Then we define the kth persistent Betti number of a random Čech complex and determine its asymptotic order in the subcritical regime. This extends a result of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 25 شماره
صفحات -
تاریخ انتشار 2011